Consensus when all processes may be Byzantine for some time
نویسندگان
چکیده
منابع مشابه
Consensus When All Processes May Be Byzantine for Some Time
Among all classes of faults, Byzantine faults form the most general modeling of value faults. Traditionally, in the Byzantine fault model, faults are statically attributed to a set of up to t processes. This, however, implies that in this model a process at which a value fault occurs is forever “stigmatized” as being Byzantine, an assumption that might not be acceptable for long-lived systems, ...
متن کاملMute Failure Detectors for Consensus with Byzantine Processes
Failure detectors have been proposed by Chandra and Toueg for solving the Consensus problem in an asynchronous system with process crash failures. The paper extends failure detectors to the case of Byzantine failures, by deening the failure detector 3M based on the notion of M ute process. The failure detector 3M is deened by the Mute Completeness and the Weak Accuracy properties. The paper als...
متن کاملAdipoRon may be benefit for atherosclerosis prevention
Atherosclerosis has serious role in coronary arteries disease,so it is important to establish effective strategies for prevention or even treatment of atherosclerosis. Adiponectin, as one of the most abundant adipokines, has insulin sensitivity, anti-inflammatory and anti-atherogenic properties. Disturbed adiponectin actions through its receptor, (AdipoR1 and AdipoR2) may be involved in atheros...
متن کاملFrom Crash to Byzantine Consensus with 2 f + 1 Processes ∗
Introduction Consensus is an important distributed computing problem that consists in making a set of processes agree on one of the values that each one of them proposes. Consensus in the asynchronous Byzantine message-passing model (the model we consider in the abstract) has been shown to require n ≥ 3f + 1 processes to be solvable in several variations of the basic system model, where f is th...
متن کاملTime-Free and Timer-Based Assumptions Can Be Combined to Solve Authenticated Byzantine Consensus
To circumvent the FLP impossibility result in a deterministic way several protocols have been proposed on top of an asynchronous distributed system enriched with additional assumptions. In the context of Byzantine failures for systems where at most t processes may exhibit a Byzantine behavior, two approaches have been investigated to solve the consensus problem.The first, relies on the addition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.11.012